#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;

int t[N], l[N];
signed main() {
  int n, d;
  cin >> n >> d;
  for (int i = 1; i <= n; i++) {
    cin >> t[i] >> l[i];
  }
  for (int k = 1; k <= d; k++) {
    int res = 0;
    for (int i = 1; i <= n; i++) {
      res = max(res, t[i] * (l[i] + k));
    }
    cout << res << endl;
  }

  return 0;
}